Shallow Lazy Proofs
نویسنده
چکیده
We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient workflow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.
منابع مشابه
The Correctness of Launchbury's Natural Semantics for Lazy Evaluation
In his seminal paper „Natural Semantics for Lazy Evaluation“ [4], John Launchbury proves his semantics correct with respect to a denotational semantics. We have formalized both semantics and identified an ambiguity in what the t operator should do: If it is understood as the least upper bound, as hinted at in the paper, the original proof fails. We fix the proof by taking a detour via a modifie...
متن کاملHuman and constructive proof of combinatorial identities: an example from Romik
It has become customary to prove binomial identities by means of the method for automated proofs as developed by Petkovšek, Wilf and Zeilberger [12]. In this paper, we wish to emphasize the role of “human” and constructive proofs in contrast with the somewhat lazy attitude of relaying on “automated” proofs. As a meaningful example, we consider the four formulas by Romik [14], related to Motzkin...
متن کاملA shallow embedding of HyperCTL
3 Shallow embedding of HyperCTL* 3 3.1 Kripke structures and paths . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Shallow representations of formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.3 Reasoning rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.4 More derived operators . . . . . . . . . . . . . . . . . . . ....
متن کاملLazy Partial Evaluation: An Integration of Explanation-Based Generalization and Partial Evaluation
In this paper we present lazy partial evaluation (LPE), a new learning technique which is a hybrid of explanation-based generalisation (EBG) and partial evaluation (PE). LPE operates in a similar way to EBG, except that the work performed exploring failed proofs is also generalised and stored. The equivalence of the set of explored proofs to the original goal de nition allows LPE to replace (ra...
متن کاملProving Lazy Folklore with Mixed Lazy/strict Semantics
Abstract. Explicit enforcement of strictness is used by functional programmers for many different purposes. Few functional programmers, however, are aware that explicitly enforcing strictness has serious consequences for (formal) reasoning about their programs. Some vague “folklore” knowledge has emerged concerning the correspondence between lazy and strict evaluation but this is based on exper...
متن کامل